regexp.Regexp.prog (field)
21 uses
regexp (current package)
backtrack.go#L132: if re.prog.Inst[pc].Op != syntax.InstFail && (arg || b.shouldVisit(pc, pos)) {
backtrack.go#L164: inst := &re.prog.Inst[pc]
backtrack.go#L193: switch re.prog.Inst[inst.Out].Op {
backtrack.go#L317: b.reset(re.prog, end, ncap)
backtrack.go#L324: if !re.tryBacktrack(b, i, uint32(re.prog.Start), pos) {
backtrack.go#L351: if re.tryBacktrack(b, i, uint32(re.prog.Start), pos) {
regexp.go#L81: prog *syntax.Prog // compiled program
regexp.go#L185: prog: prog,
regexp.go#L237: m.p = re.prog
regexp.go#L249: n = len(re.prog.Inst)
regexp.go#L592: if nmatch > re.prog.NumCap {
regexp.go#L593: nmatch = re.prog.NumCap
regexp.go#L869: m := re.find(nil, b, "", 0, re.prog.NumCap, dstCap[:0])
regexp.go#L887: a := re.find(nil, nil, s, 0, re.prog.NumCap, dstCap[:0])
regexp.go#L904: return re.pad(re.find(nil, b, "", 0, re.prog.NumCap, nil))
regexp.go#L911: return re.pad(re.find(nil, nil, s, 0, re.prog.NumCap, nil))
regexp.go#L922: return re.pad(re.find(r, nil, "", 0, re.prog.NumCap, nil))
regexp.go#L973: for m := range re.matches("", b, n, re.prog.NumCap) {
regexp.go#L991: for m := range re.matches(s, nil, n, re.prog.NumCap) {
regexp.go#L1009: for m := range re.matches("", b, n, re.prog.NumCap) {
regexp.go#L1021: for m := range re.matches(s, nil, n, re.prog.NumCap) {